Approximating geometric bottleneck shortest paths
نویسندگان
چکیده
منابع مشابه
Approximating Geometric Bottleneck Shortest Paths
In a geometric bottleneck shortest path problem, we are given a set S of n points in the plane, and want to answer queries of the following type: Given two points p and q of S and a real number L, compute (or approximate) a shortest path between p and q in the subgraph of the complete graph on S consisting of all edges whose lengths are less than or equal to L. We present efficient algorithms f...
متن کاملGeometric kth shortest paths
1 This paper studies algorithmic and combinatorial properties of shortest paths of different homo2 topy types in a polygonal domain with holes. We define the “second shortest path” to be the shortest 3 path that is homotopically different from the (first) shortest path; the kth shortest path for an arbitrary 4 integer k is defined analogously. We introduce the “kth shortest path map”—a structur...
متن کاملGeometric k Shortest Paths
We consider the problem of computing k shortest paths in a two-dimensional environment with polygonal obstacles, where the jth path, for 1 j k, is the shortest path in the free space that is also homotopically distinct from each of the first j 1 paths. In fact, we consider a more general problem: given a source point s, construct a partition of the free space, called the kth shortest path m...
متن کاملCombining Shortest Paths, Bottleneck Paths and Matrix Multiplication
We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of ...
متن کاملCombining the Shortest Paths and the Bottleneck Paths Problems
We combine the well known Shortest Paths (SP) problem and the Bottleneck Paths (BP) problem to introduce a new problem called the Shortest Paths for All Flows (SP-AF) problem that has relevance in real life applications. We first solve the Single Source Shortest Paths for All Flows (SSSP-AF) problem on directed graphs with unit edge costs in O(mn) worst case time bound. We then present two algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.04.003